A Pascal-like Triangle Related to the Tribonacci Numbers
نویسنده
چکیده
A tile composed of two pieces, which we refer to as a fence tile, is introduced to give the Tribonacci numbers a new combinatorial interpretation. The interpretation is used to construct a Pascal-like triangle and various identities concerning the triangle are proven. An intuitive proof of a general identity for the Tribonacci numbers in terms of sums of products of the binomial coefficients is given. A connection with sequence A120415 from Sloane’s Encyclopedia of Integer Sequences is also made.
منابع مشابه
More Identities On The Tribonacci Numbers
In this paper, we use a simple method to derive di¤erent recurrence relations on the Tribonacci numbers and their sums. By using the companion matrices and generating matrices, we get more identities on the Tribonacci numbers and their sums, which are more general than that given in literature [E. Kilic, Tribonacci Sequences with Certain Indices and Their Sum, Ars Combinatoria 86 (2008), 13-22....
متن کاملThe Pfaffian Transform
We introduce a function on sequences, which we call the Pfaffian transform, using the Pfaffian of a skew-symmetric matrix. We establish several basic properties of the Pfaffian transform, and we use the transfer matrix method to show that the set of sequences with rational generating functions is closed under the Pfaffian transform. We conclude by computing the Pfaffian transform of a variety o...
متن کاملA Tribonacci-Like Sequence of Composite Numbers
We find a new Tribonacci-like sequence of positive integers 〈x0, x1, x2, . . .〉 given by xn = xn−1 + xn−2 + xn−3 , n ≥ 3, and gcd(x0, x1, x2) = 1 that contains no prime numbers. We show that the sequence with initial values x0 = 151646890045, x1 = 836564809606, x2 = 942785024683 is the current record in terms of the number of digits.
متن کاملLarge primes in generalized Pascal triangles
In this paper, after presenting the results of the generalization of Pascal triangle (using powers of base numbers), we examine some properties of the 112-based triangle, most of all regarding to prime numbers. Additionally, an effective implementation of ECPP method is presented which enables Magma computer algebra system to prove the primality of numbers with more than 1000 decimal digits. 1 ...
متن کاملIncomplete generalized Tribonacci polynomials and numbers
The main object of this paper is to present a systematic investigation of a new class of polynomials – incomplete generalized Tribonacci polynomials and a class of numbers associated with the familiar Tribonacci polynomials. The various results obtained here for these classes of polynomials and numbers include explicit representations, generating functions, recurrence relations and summation fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009